Predicate Transformers for Recursive Procedures with Local Variables
نویسندگان
چکیده
منابع مشابه
Auxiliary Variables and Recursive Procedures
Much research in axiomatic semantics suuers from a lack of formality. In particular, most proposed veriication calculi for imperative programs dealing with recursive procedures are known to be unsound or incomplete. Focussing on total correctness, we present a new consequence rule which yields a sound and complete Hoare-style calculus in the presence of parameterless recursive procedures. Both,...
متن کاملPredicate Transformers for Convex Powerdomains
We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to convex powerdomains, the appropriate powerdomains for the combin...
متن کاملHealthiness Conditions for Predicate Transformers
The behavior of a program can be modeled by describing how it transforms input states to output states, the state transformer semantics. Alternatively, for verification purposes one is interested in a ’predicate transformer semantics’ which, for every condition on the output, yields the weakest precondition on the input that guarantees the desired property for the output. In the presence of com...
متن کاملUnderapproximating Predicate Transformers
We study the underapproximation of the predicate transformers used to give semantics to the modalities in dynamic and temporal logic. Because predicate transformers operate on state sets, we define appropriate powerdomains for sound approximation. We study four such domains — two are based on “set inclusion” approximation, and two are based on “quantification” approximation — and we apply the d...
متن کاملImpUNITY: UNITY with Procedures and Local Variables
In this paper we present the ImpUNITY framework, a framework that supports the development of parallel and distributed programs from speciication to implementation in a stepwise manner. The ImpUNITY framework is an extension of UNITY, as introduced by Chandy and Misra, with features of the Action System formalism of Back and Kurki-Suonio. Due to this extension, the ImpUNITY framework is more su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 1999
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s001659970002